Finding an optimal Nash equilibrium to the multi-agent project scheduling problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding an optimal Nash equilibrium to the multi-agent project scheduling problem

multi-agent project scheduling problem Cyril Briand , Sandra Ulrich Ngueveu and Přemysl Š̊ucha (1) CNRS ; LAAS ; 7 avenue du colonel Roche, F-31077 Toulouse Cedex 4, France, (2) Université de Toulouse ; UPS, INP; LAAS; F-31077 Toulouse Cedex 4, France (3) Czech Technical University in Prague; Faculty of Electrical Engineering; Karlovo namesti 13, 121 35, Prague 2, Czech Republic Emails: {briand,...

متن کامل

Finding Pure Nash Equilibrium for the Resource Constrained Project Scheduling Problem

The paper focuses on solving the ResourceConstrained Project Scheduling (RCPS) problem with a method based on intelligent agents. Parallelism for performing the tasks is allowed. Common and limited resources are available to all agents. The agents are non-cooperative and compete with each other for the use of common resources, thereby forming instances of RCPS problem. We analyze the global joi...

متن کامل

The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...

متن کامل

Nash equilibria for the multi-agent project scheduling problem with controllable processing times

This paper considers a project scheduling environment in which the activities of the project network are partitioned among a set of agents. Activity durations are controllable, i.e., every agent is allowed to shorten the duration of its activities, incurring a crashing cost. If the project makespan is reduced with respect to its normal value, a reward is offered to the agents and each agent rec...

متن کامل

the combinatorial multi-mode resource constrained multi-project scheduling problem

this paper presents the formulation and solution of the combinatorial multi-mode resource constrained multi-project scheduling problem. the focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. the motivation for developing such an approach is due in part to practica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scheduling

سال: 2017

ISSN: 1094-6136,1099-1425

DOI: 10.1007/s10951-017-0516-2